Rewrite Systems with Abstraction and β-rule: Types, Approximants and Normalization
نویسندگان
چکیده
In this paper we define and study intersection type assignment systems for first-order rewriting extended with application, λ-abstraction, and β-reduction (TRS+β). One of the main results presented is that, using a suitable notion of approximation of terms, any typeable term of a TRS+β that satisfies a general scheme for recursive definitions has an approximant of the same type. From this result we deduce, for different classes of typeable terms, a head-normalization and a normalization theorem.
منابع مشابه
Rewriting Modulo \beta in the \lambda\Pi-Calculus Modulo
The λ Π-calculus Modulo is a variant of the λ -calculus with dependent types where β -conversion is extended with user-defined rewrite rules. It is an expressive logical framework and has been used to encode logics and type systems in a shallow way. Basic properties such as subject reduction or uniqueness of types do not hold in general in the λ Π-calculus Modulo. However, they hold if the rewr...
متن کاملInductive Data Type Systems: Strong Normalization
This paper is concerned with the foundations of Inductive Data Type Systems, an extension of pure type systems by inductive data types. IDTS generalize (inductive) types equipped with primitive recursion of higher-type, by providing de nitions of functions by pattern matching of a form which is general enough to capture recursor de nitions for strictly positive inductive types. IDTS also genera...
متن کاملSyntactical Strong Normalization for Intersection Types with Term Rewriting Rules
We investigate the intersection type system of Coquand and Spiwack with rewrite rules and natural numbers and give an elementary proof of strong normalization which can be formalized in a weak metatheory.
متن کاملPolymorphic Intersection Type Assignment for Rewrite Systems with Abstraction and -rule?
We define two type assignment systems for first-order rewriting extended with application, -abstraction, and -reduction (TRS+ ). The types used in these systems are a combination of (!-free) intersection and polymorphic types. The first system is the general one, for which we prove a subject reduction theorem and show that all typeable terms are strongly normalisable. The second is a decidable ...
متن کاملA Compiled Implementation of Normalization by Evaluation
We present a novel compiled approach to Normalization by Evaluation (NBE) for ML-like languages. It supports efficient normalization of open λ-terms w.r.t. β-reduction and rewrite rules. We have implemented NBE and show both a detailed formal model of our implementation and its verification in Isabelle. Finally we discuss how NBE is turned into a proof rule in Isabelle.
متن کامل